package base.tree.maxDeptTree;

import base.tree.TreeNode;

public class Solution {

    // 二叉树的最大深度
    public int maxDepth(TreeNode root) {

        if (root==null) return 0;

        int left=maxDepth(root.left);

        int right = maxDepth(root.right);

        return left>right? left+1 : right+1;
    }

}
